Static Quantum Games Revisited
نویسندگان
چکیده
The so called quantum game theory has recently been proclaimed as one of the new branches in the development of both quantum information theory and game theory. However, the notion of a quantum game itself has never been strictly defined, which has led to a lot of conceptual confusion among different authors. In this paper we introduce a new conceptual framework of a scenario and an implementation of a game. It is shown that the procedures of “quantization” of games proposed in the literature lead in fact to several different games which can be defined within the same scenario, but apart from this they may have nothing in common with the original game. Within the framework we put forward, a lot of conceptual misunderstandings that have arisen around “quantum games” can be stated clearly and resolved uniquely. In particular, the proclaimed essential role of entanglement in several static “quantum games”, and their connection with Bell inequalities, is disproved.
منابع مشابه
Quantum realization of extensive games
We generalize a concept of classical finite extensive game to make it useful for application of quantum objects. The generalization extends a quantum realization scheme of static games to any finite extensive game. It represents an extension of any classical finite extensive games to the quantum domain. In addition our model is compatible with well-known quantum schemes of static games. The pap...
متن کاملQuantum repeated games revisited
We present a scheme for playing quantum repeated 2 × 2 games based on the Marinatto and Weber's approach [1] to quantum games. As a potential application , we study twice repeated Prisoner's Dilemma game. We show that results not available in classical game can be obtained when the game is played in the quantum way. Before we present our idea, we comment on the previous scheme of playing quantu...
متن کاملConstraint Games revisited
Constraint Games are a recent framework proposed to model and solve static games where Constraint Programming is used to express players preferences. In this paper, we rethink their solving technique in terms of constraint propagation by considering players preferences as global constraints. It yields not only a more elegant but also a more efficient framework. Our new complete solver is faster...
متن کاملBoolean Games Revisited
Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [7] are two players, zero-sum static games where player’s utility functions are binary and described by a single propositional formula, and the strategies available to a player consist of truth assignments to each of a given set of propositional variables (the variables controlled by th...
متن کاملA Quantum Approach To Static Games Of Complete Information
We extend the concept of a classical two-person static game to the quantum domain, by giving an Hilbert structure to the space of classical strategies and studying the Battle of the Sexes game. We show that the introduction of entangled strategies leads to a unique solution of this game. PACS: 03.65.-w, 03.65.Bz
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010